On Exponential Time Algorithm for k-SAT
نویسنده
چکیده
In this work we present and analyze a simple algorithm for finding satisfying assignments of k-CNF (Boolean formulae in conjunctive normal form with at most k literals per clause). Our work is motivated by a simple question: Are there any structural property of the k-CNF which could help us to understand if a formula accepts isolated assignment? And can we deterministically find such isolated assignment if formula has one? In this work we show such a property exists in almost all non-trivial k-CNF formula, and we call it rigidity of a clause. Informally, rigidity of a clause can be defined to be how well connected a clause is to other clauses having same literals. If we satisfy a rigid clause for most of its literals then some of the variables are forced to take fixed values. Since, we can force such property and still get a satisfiable assignment; we save some of the decision paths in the algorithm and reduce its time complexity. Our main lemma shows that the number of branches in a depth n decision tree for k-CNF will be at least 2 n− (
منابع مشابه
On the Complexity of k-SAT
The k-SAT problem is to determine if a given k-CNF has a satisfying assignment. It is a celebrated open question as to whether it requires exponential time to solve k-SAT for k 3. Here exponential time means 2 for some $>0. In this paper, assuming that, for k 3, k-SAT requires exponential time complexity, we show that the complexity of k-SAT increases as k increases. More precisely, for k 3, de...
متن کاملComplexity of k-SAT
The problem of k-SAT is to determine if the given k-CNF has a satisfying solution. It is a celebrated open question as to whether it requires exponential time to solve k-SAT for k 3. Define sk (for k 3) to be the infimum of fÆ : there exists an O(2) algorithm for solving k-SATg. Define ETH (Exponential-Time Hypothesis) for k-SAT as follows: for k 3, sk > 0. In other words, for k 3, kSAT does no...
متن کاملExponential Lower Bounds for the PPSZ k-SAT Algorithm
In 1998, Paturi, Pudlák, Saks, and Zane presented PPSZ, an elegant randomized algorithm for k-SAT. Fourteen years on, this algorithm is still the fastest known worst-case algorithm. They proved that its expected running time on k-CNF formulas with n variables is at most 2(1− k, where k ∈ Ω(1/k). So far, no exponential lower bounds at all have been known. In this paper, we construct hard instanc...
متن کاملLecture 17 : The Strong Exponential Time Hypothesis
For SAT and CIRCUIT -SAT there is an obvious brute force algorithm that requires 2m time where n is the number of variables and m is a measure of the overall input size. How much better we can seems to depend on the input structure. In the case of kSAT there are some improvements. Theorem 1.1 (Paturi-Pudlak,Schöning,Paturi-Pudlak-Saks-Zane,Hertli). For constants 1 ≤ c ≤ 2, there are (randomized...
متن کاملImproved Algorithms for Sparse MAX-SAT and MAX-k-CSP
We give improved deterministic algorithms solving sparse instances of MAX-SAT and MAX-k-CSP. For instances with n variables and cn clauses (constraints), we give algorithms running in time poly(n)· 2n(1−μ) for – μ = Ω( 1 c ) and polynomial space solving MAX-SAT and MAX-kSAT, – μ = Ω( 1 √ c ) and exponential space solving MAX-SAT and MAX-kSAT, – μ = Ω( 1 ck2 ) and polynomial space solving MAX-k-...
متن کاملA comparative runtime analysis of heuristic algorithms for satisfiability problems
The satisfiability problem is a basic core NP-complete problem. In recent years, a lot of heuristic algorithms have been developed to solve this problem, and many experiments have evaluated and compared the performance of different heuristic algorithms. However, rigorous theoretical analysis and comparison are rare. This paper analyzes and compares the expected runtime of three basic heuristic ...
متن کامل